Multiple Parallel Federated Learning via Over-the-Air Computation

نویسندگان

چکیده

This paper investigates multiple parallel federated learning in cellular networks, where a base station schedules several FL tasks and each task has group of devices involved. To reduce the communication overhead, over-the-air computation is introduced by utilizing superposition property access channels (MAC) to accomplish aggregation step. Since all use same radio resource transfer their local updates BS, order separate received signals different tasks, we zero-forcing receiver combiner mitigate mutual interference across groups. Besides, analyze impact device selection on convergence our framework. Also, formulate an optimization problem that jointly considers vector design for improving performance. We address decoupling it into two sub-problems solve them alternatively, adopting successive convex approximation (SCA) derive vector, then scheduling with greedy algorithm. Simulation results demonstrate proposed framework can effectively straggler issue achieve near-optimal performance tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pigeons acquire multiple categories in parallel via associative learning: a parallel to human word learning?

Might there be parallels between category learning in animals and word learning in children? To examine this possibility, we devised a new associative learning technique for teaching pigeons to sort 128 photographs of objects into 16 human language categories. We found that pigeons learned all 16 categories in parallel, they perceived the perceptual coherence of the different object categories,...

متن کامل

Over-the-air Function Computation in Sensor Networks

Many sensor applications are interested in computing a function over measurements (e.g., sum, average, max) as opposed to collecting all sensor data. Today, such data aggregation is done in a cluster-head. Sensor nodes transmit their values sequentially to a cluster-head node, which calculates the aggregation function and forwards it to the base station. In contrast, this paper explores the pos...

متن کامل

Parallel computation of multiple biological sequence comparisons.

A parallel implementation of an efficient method for comparison of multiple DNA sequences is presented. The method is described in terms of a conceptual tree data structure for the sequences to be compared. The parallel algorithm shows efficient utilization of processors on an Encore Multimax computer in a sample comparison of 11 sequences totaling over 4000 bases. Timing data show the strong i...

متن کامل

Parallel Multiple Sequence Alignment Using Speculative Computation

Many different methods have been presented for aligning multiple biological sequences. These methods can be classified into three categories: rigorous, tree-based, and iterative. The rigorous method, which always generates the optimal alignment, requires memory space and computation time proportional to the product of the sequence lengths. Even for a modest number of sequences, this method beco...

متن کامل

Secure Centrality Computation Over Multiple Networks

Consider a multilayer graph, where the different layers correspond to different proprietary social networks on the same ground set of users. Suppose that the owners of the different networks (called hosts) are mutually non-trusting parties: how can they compute a centrality score for each of the users using all the layers, but without disclosing information about their private graphs? Under thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE open journal of the Communications Society

سال: 2022

ISSN: ['2644-125X']

DOI: https://doi.org/10.1109/ojcoms.2022.3194821